String Indexing. PRECIS: Introdution and Indexing; String Indexing. NEPHIS: Introduction and Indexing; String Indexing. Relational Indexing: Introduction and Indexing (Book Review)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indexing for String Queries using

We present ve index trees designed for supporting string searches. We discuss Counted Trees, Substring Trees, and Regular Expression Trees, all of which suuer the same problem { their attempts at approximating a large set of data lead to an almost complete lack of information in the interior nodes. A variant of B-Trees, called a Preex-Suux Tree, avoids this diiculty by severely restricting the ...

متن کامل

Indexing Methods for Approximate String Matching

Indexing for approximate text searching is a novel problem receiving much attention because of its applications in signal processing, computational biology and text retrieval, to name a few. We classify most indexing methods in a taxonomy that helps understand their essential features. We show that the existing methods, rather than completely diierent as they are regarded, form a range of solut...

متن کامل

On Hardness of Several String Indexing Problems

Let D = {d1, d2, ..., dD} be a collection of D string documents of n characters in total. The two-pattern matching problems ask to index D for answering the following queries efficiently. – report/count the unique documents containing P1 and P2. – report/count the unique documents containing P1, but not P2. Here P1 and P2 represent input patterns of length p1 and p2 respectively. Linear space d...

متن کامل

Indexing Structures for Approximate String Matching

In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: College & Research Libraries

سال: 1979

ISSN: 2150-6701,0010-0870

DOI: 10.5860/crl_40_03_293